Logic programs, well-orderings and forward chaining
نویسندگان
چکیده
منابع مشابه
Logic Programs, Well-Orderings, and Forward Chaining
We investigate the construction of stable models of general propositional logic programs. We show that a forward-chaining technique, supplemented by a properly chosen safeguards can be used to construct stable models of logic programs. Moreover, the proposed method has the advantage that if a program has no stable model, the result of the construction is a stable model of a subprogram. Further,...
متن کاملBasic Forward Chaining Construction for Logic Programs
One of the problems which motivated this paper is how do we deal with inconsistent information. For example, suppose that we want to develop an expert system using logic programming with negation as failure. It may be the case that the knowledge engineer gathers facts, i.e. clauses of the form p ←, rules without exceptions, i.e. clauses of the form p ← q1, . . . qn, and rules with exception or ...
متن کاملForward and Backward Chaining in Linear Logic
Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical basis for programs which execute within a dynamic environment. Most linear logic programming languages are implemented using standard resolution or backward chaining techniques. However, there are many applications in which the c...
متن کاملOrdered Chaining for Total Orderings
We design new inference systems for total orderings by applying rewrite techniques to chaining calculi. Equality relations may either be specified axiomatically or built into the deductive calculus via paramodulation or superposition. We demonstrate that our inference systems are compatible with a concept of (global) redundancy for clauses and inferences that covers such widely used simplificat...
متن کاملA Parallel Virtual Machine for Executing Forward-Chaining Linear Logic Programs
Linear Meld is a concurrent forward-chaining linear logic programming language where logical facts can be asserted and retracted in a structured way. The database of facts is partitioned by the nodes of a graph structure which leads to parallelism if nodes are executed simultaneously. Communication arises whenever nodes send facts to other nodes by fact derivation. We present an overview of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1999
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(98)00041-4